Veri cation of All Circuits in a Floating - Point UnitUsing Word - Level Model
نویسندگان
چکیده
This paper presents the formal veriication of all sub-circuits in a oating-point arithmetic unit (FPU) from an Intel microprocessor using a word-level model checker. This work represents the rst large-scale application of word-level model checking techniques. The FPU can perform addition, subtraction, multiplication, square root, division, remainder, and rounding operations; verifying such a broad range of function-ality required coupling the model checker with a number of other techniques, such as property decomposition, property speciic model abstraction, and latch removal. We will illustrate the veriication techniques used by us with respect to the design of the Weitek WTL3170/3171 Sparc oating point coprocessor. The principal contribution of this paper is a practical veriication methodology explaining what techniques to apply (and where to apply them) when verifying oating-point arithmetic circuits. We have applied our methods to the oating-point unit of a state-of-the-art Intel microprocessor, which is capable of extended precision (64-bit mantissa) computation. The success of this eeort demonstrates that word-level model checking, with the help of other veriication techniques, can verify arithmetic circuits of the size and complexity found in industry.
منابع مشابه
Veri cation of All Circuits in a Floating - PointUnit Using Word - Level Model CheckingYirng -
This paper presents the formal veriication of all sub-circuits in a oating-point arithmetic unit (FPU) from an Intel microprocessor using a word-level model checker. This work represents the rst large-scale application of word-level model checking techniques. The FPU can perform addition, subtraction , multiplication, square root, division, remainder, and rounding operations; verifying such a b...
متن کاملVeri cation of Arithmetic Functions with Binary Moment Diagrams
Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitary functions from Boolean variables to real, rational, or integer values. BMDs can thus model the functionality of data path circuits operating over word level data. Many im...
متن کاملVeri cation of Analog and Mixed-Signal Circuits using Hybrid System Techniques
In this paper we demonstrate a potential extension of formal veri cation methodology in order to deal with analog and mixed-signal circuits. In particular, we focus on verifying time-domain properties. The time-dependent behavior of an analog circuit can be described by a system of di erential algebraic equations. To analyze such circuits under all possible input signals and all values of param...
متن کاملVerification of All Circuits in a Floating-Point Unit Using Word-Level Model Checking
1 I n t r o d u c t i o n The floating-point division flaw [SB94, Coe95] in Intel Corp.'s Pentium underscores howhard the task of verifying a floating-point arithmetic unit is, and how high the cost of a floating-point arithmetic bug can be. About one trillion test vectors were used and none uncovered the bug. The recall and replacement of the chips in the field cost Intel $470 million. Since t...
متن کاملVeri cation of Arithmetic Circuits Using Binary MomentDiagrams ?
Binary Moment Diagrams (BMDs) provide a canonical representations for linear functions similar to the way Binary Decision Diagrams (BDDs) represent Boolean functions. Within the class of linear functions, we can embed arbitrary functions from Boolean variables to real, rational, or integer values. BMDs can thus model the functionality of data path circuits operating over word level data. Many i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996